Model Selection via Information Criteria for Tree Models and Markov Random Fields
نویسنده
چکیده
منابع مشابه
Model Selection via Information Criteria
This is a survey of the information criterion approach to model selection problems. New results about context tree estimation and the estimation of the basic neighborhood of Markov random fields are also mentioned. 1. The model selection problem Let a stochastic process {Xt, t ∈ T } be given, where each Xt is a random variable with values a ∈ A, and T is an index set. The joint distribution of ...
متن کاملHidden Markov Random Field Model Selection Criteria Based on Mean Field-Like Approximations
Hidden Markov random fields appear naturally in problems such as image segmentation, where an unknown class assignment has to be estimated from the observations at each pixel. Choosing the probabilistic model that best accounts for the observations is an important first step for the quality of the subsequent estimation and analysis. A commonly used selection criterion is the Bayesian Informatio...
متن کاملModel Selection for a Class of Spatio-temporal Models for Areal Data
We present a method to perform model selection based on predictive density in a class of spatio-temporal dynamic generalized linear models for areal data. These models assume a latent random field process that evolves through time with random field convolutions; the convolving fields follow proper Gaussian Markov random field processes. Parameter and latent process estimation based on Markov Ch...
متن کاملEnsemble of M5 Model Tree Based Modelling of Sodium Adsorption Ratio
This work reports the results of four ensemble approaches with the M5 model tree as the base regression model to anticipate Sodium Adsorption Ratio (SAR). Ensemble methods that combine the output of multiple regression models have been found to be more accurate than any of the individual models making up the ensemble. In this study additive boosting, bagging, rotation forest and random subspace...
متن کاملApproximate Bayes Model Selection Procedures for Markov Random Fields
For applications in texture synthesis, we derive two approximate Bayes criteria for selecting a model from a collection of Markov random fields. The first criterion is based on a penalized maximum likelihood. The second criterion, a Markov chain Monte Carlo approximation to the first, has distinct computational advantages. Some simulation results are also presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004